Algebraic attacks using SAT-solvers
نویسندگان
چکیده
Algebraic attacks lead to the task of solving polynomial systems over F2. We study recent suggestions of using SAT-solvers for this task. In particular, we develop several strategies for converting the polynomial system to a set of CNF clauses. This generalizes the approach in [4]. Moreover, we provide a novel way of transforming a system over F2e to a (larger) system over F2. Finally, the efficiency of these methods is examined using standard examples such as CTC, DES, and Small Scale AES.
منابع مشابه
Algebraic Cryptanalysis of Deterministic Symmetric Encryption
Deterministic symmetric encryption is widely used in many cryptographic applications. The security of deterministic block and stream ciphers is evaluated using cryptanalysis. Cryptanalysis is divided into two main categories: statistical cryptanalysis and algebraic cryptanalysis. Statistical cryptanalysis is a powerful tool for evaluating the security but it often requires a large number of pla...
متن کاملAlgebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers
This paper presents the first results on AIDA/cube, algebraic and sidechannel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Our cube attacks reach 60, 40 and 30 rounds of KATAN32, KATAN48 and KATAN64, respectively. In our algebraic attacks, we use SAT solvers as a tool to solve the quadratic equations representation of all KATAN ciphers. We introduced...
متن کاملA New Set of Algebraic Benchmark Problems for SAT Solvers
Solving open quasigroup existence problems is a challenging problem to which SAT solvers have been applied successfully. However, the number of problems of this domain is relatively small and its use as a benchmark is therefore restricted. We propose a new benchmark set that generalises and extends the quasigroup existence domain by using problems generated during the construction of classifica...
متن کاملRSA private key reconstruction from random bits using SAT solvers
SAT solvers are being used more and more in Cryptanalysis, with mixed results regarding their e ciency, depending on the structure of the algorithm they are applied. However, when it comes to integer factorization, or more specially the RSA problem, SAT solvers prove to be at least ine cient. The running times are too long to be compared with any well known integer factorization algorithm, even...
متن کاملAlgebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared
The SMS4 block cipher is part of the Chinese WAPI wireless standard. This paper describes the specification and offers a specification for a toy version called simplified SMS4 (S-SMS4). We explore algebraic attacks on SMS4 and S-SMS4 using Gröbner basis attacks on equation systems over GF(2) and GF(2), as well as attacks using a SAT solver derived from the GF(2) model. A comparison of SAT and G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Groups Complexity Cryptology
دوره 2 شماره
صفحات -
تاریخ انتشار 2010